Fuzzy Database Query Languages and Their Relational Completeness Theorem

نویسنده

  • Yoshikane Takahashi
چکیده

Two fuzzy database query languages are proposed. They are used to query to fuzzy databases that are enhanced from relational databases in a way that fuzzy sets are allowed in both attribute values and truth values. A fuzzy calculus query language is constructed based on the relational calculus and a fuzzy algebra query language is also constructed based on the relational algebra. In addition, this paper proves a fuzzy relational completeness theorem such that both the languages have equivalent expressive power to each other.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Flexible Query Languages for Relational Databases: An Overview

We present an overview of the most important proposals for human-oriented query languages for relational databases, based on fuzzy sets theory. To highlight important issues concerning communication with databases, we propose two taxonomies: the first taxonomy deals with flexible query languages in crisp relational databases and the second deals with flexible query languages in fuzzy relational...

متن کامل

Apply Uncertainty in Document-Oriented Database (MongoDB) Using F-XML

As moving to big data world where data is increasing in unstructured way with high velocity, there is a need of data-store to store this bundle amount of data. Traditionally, relational databases are used which are now not compatible to handle this large amount of data, so it is needed to move on to non-relational data-stores. In the current study, we have proposed an extension of the Mongo...

متن کامل

Apply Uncertainty in Document-Oriented Database (MongoDB) Using F-XML

As moving to big data world where data is increasing in unstructured way with high velocity, there is a need of data-store to store this bundle amount of data. Traditionally, relational databases are used which are now not compatible to handle this large amount of data, so it is needed to move on to non-relational data-stores. In the current study, we have proposed an extension of the Mongo...

متن کامل

A Fuzzification of the Relational Data Model

Expression and processing of vagueness, which has many real world applications, is not handled effectively in the conventional relational model. In this paper we investigate a fuzzy extension to the relational data model and propose three fuzzy relational query languages. ‘ho of them are the Level-l Fuzzy Relational Algebra and Level-l Fmzy Relational Calculus. They are fundamental query langua...

متن کامل

Review - On Instance-Completeness for Database Query Languages involving Object Creation

In [4, 13], Bancilhon and Paredaens introduced a notion of completeness for relational database languages on instance-level. Their criterion was subsequently called BP-completeness. Since then, it was used frequently in the context of other database models. However, its application in the context of languages involving object creation appears to raise some serious problems. In this paper, we us...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IEEE Trans. Knowl. Data Eng.

دوره 5  شماره 

صفحات  -

تاریخ انتشار 1993